1421D - Hexagons - CodeForces Solution

#include <bits/stdc++.h>
#define ll long long
using namespace std;

ll x, y, c[7];

void solve(){
cin >> x >> y;
for(int i=1;i<=6;i++) cin >> c[i];
ll B=y-x,A=y-B;
ll r1=(A<0?c[4]:c[1])*abs(A)+(B<0?c[5]:c[2])*abs(B);
B=x-y,A=x-B;
ll r2=(A<0?c[4]:c[1])*abs(A)+(B<0?c[3]:c[6])*abs(B);
A=x,B=y;
ll r3=(A<0?c[3]:c[6])*abs(A)+(B<0?c[5]:c[2])*abs(B);
cout<<min({r1,r2,r3});
}

int main()
{
int t;
cin >> t;
while(t--){
solve();
cout << "\n";
}
}